Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules
نویسندگان
چکیده
We show that termination is decidable for rewrite systems that contain shallow and right-linear rules, collapsing rules, and rightground rules. This class of rewrite systems is expressive enough to include interesting rules. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving and hence the reachability and joinability problems are decidable. Decidability of termination is obtained by analyzing the nonterminating derivations.
منابع مشابه
Non - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملTermination of Rewriting with Right-Flat Rules Modulo Permutative Theories
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termin...
متن کاملDeciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure
Right-(ground or variable) rewrite systems (RGV systems for short) are term rewrite systems where all right hand sides of rules are restricted to be either ground or a variable. We define a minimal rewrite extensionR of the rewrite relation induced by a RGV system R. This extension admits a rewrite closure presentation, which can be effectively constructed from R. The rewrite closure is used to...
متن کاملConfluence of Shallow Right-Linear Rewrite Systems
We show that confluence of shallow and right-linear term rewriting systems is decidable. This class of rewriting system is expressive enough to include nontrivial nonground rules such as commutativity, identity, and idempotence. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving, which implies that its reachability and joinability problems are decida...
متن کاملSome Classes of Term Rewriting Systems for which Termination is Decidable
Termination is one of the central properties of term rewriting systems (TRSs for short). A TRS is called terminating if it does not admit any infinite rewrite sequence. The efforts to find classes of TRSs whose termination is decidable have been made for decades and several positive results have been proposed, for example, right-ground TRSs and right-linear shallow TRSs. In this research, we st...
متن کامل